On the Possibilities for Partitioning a Cake
نویسندگان
چکیده
We wish to consider the following type of cake division problem: There are p individuals. Each individual has available a measure that he or she uses to evaluate the sizes of pieces of cake. We wish to partition our cake into q pieces in such a way that the various evaluations that the individuals make of the sizes of the pieces satisfy certain pre-assigned equalities and inequalities. Our main result yields a quite general criterion for showing that certain such partitions exist. Following the proof, we consider various applications.
منابع مشابه
Perfect divisions of a cake
The problem studied in this paper arises from a simple practical problem: how to divide a cake among the children attending a birthday p a r t y i n s u c h a way that each c hild gets the same amount o f c a k e and (perhaps more important to them) the same amount of icing. Let S be a convex set contained in the (xx y)-plane. In mathematical terms, a c a k e C with base S is a solid containing...
متن کاملEffects of Sunflower Cake Integration on Ration Digestibility and Metabolic Profile in Equine Tourism Horses
The scope for using sunflower cake in ration formulation was tested in 6 horses employed for equine tourism. Three experimental diets providing the same amount of proteins and energy as the control diet were formulated using rising doses of sunflower cake (SD3: 0.3 kg; SD6: 0.6 kg and SD10: 1.0 kg). Digestibility evaluation using internal markers showed that rising sunflower cake doses reduced ...
متن کاملRadial Perfect Partitions of Convex Sets in thePlaneJ
In this paper we study the following problem: how to divide a cake among the children attending a birthday party such that all the children get the same amount of cake and the same amount of icing. This leads us to the study of the following. A perfect k-partitioning of a convex set S is a partitioning of S into k convex pieces such that each piece has the same area and 1 k of the perimeter of ...
متن کاملHaplotype Block Partitioning and tagSNP Selection under the Perfect Phylogeny Model
Single Nucleotide Polymorphisms (SNPs) are the most usual form of polymorphism in human genome.Analyses of genetic variations have revealed that individual genomes share common SNP-haplotypes. Theparticular pattern of these common variations forms a block-like structure on human genome. In this work,we develop a new method based on the Perfect Phylogeny Model to identify haplo...
متن کاملRadial Perfect Partitions of Convex Sets in the Plane
In this paper we study the following problem: how to divide a cake among the children attending a birthday party such that all the children get the same amount of cake and the same amount of icing. This leads us to the study of the following. A perfect k-partitioning of a convex set S is a partitioning of S into k convex pieces such that each piece has the same area and 1 k of the perimeter of ...
متن کامل